package base;

import java.util.ArrayList;

/**
 *  Copyright (c) 1999-2011, Ecole des Mines de Nantes
 *  All rights reserved.
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *
 *      * Redistributions of source code must retain the above copyright
 *        notice, this list of conditions and the following disclaimer.
 *      * Redistributions in binary form must reproduce the above copyright
 *        notice, this list of conditions and the following disclaimer in the
 *        documentation and/or other materials provided with the distribution.
 *      * Neither the name of the Ecole des Mines de Nantes nor the
 *        names of its contributors may be used to endorse or promote products
 *        derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
 *  EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 *  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 *  DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
 *  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 *  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 *  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

/**
 * Created by IntelliJ IDEA. User: njussien Date: 30/11/12 Time: 10:33
 */
public class Non extends OperateurUnaire {
	public Non(Formule f) {
		super(f);
	}

	@Override
	public Formule negation() {
		return operande;
	}

	@Override
	public Formule descendreNon() {

		if (!(operande instanceof Atome)) {
			return (operande.negation()).descendreNon();
		} else {
			return this;
		}

	}

	public String toString() {
		return "Non(" + operande.toString() + ")";
	}

	@Override
	public Formule enleveEquImp() {
		return new Non(operande.enleveEquImp());
	}

	public void substituer(Variable var, Terme terme) {
		operande.substituer(var, terme);
	}

	public void renommer() {
		operande.renommer();
	}

	@Override
	public Formule remonterQuantificateurs() {
		return this;
	}

	@Override
	public Formule toConjonctive() {
		return this;
	}

	public boolean contains(Atome a) {
		return false;
	}

	public boolean containsNegative(Atome a) {
		return operande.contains(a);
	}

	public boolean equals(Object o) {
		if (o instanceof Non) {
			return (operande.equals(((Non) o).operande));
		} else {
			return false;
		}
	}

	public Non supprimer(Atome a) {
		return this;
	}

	public Non supprimer(Non a) {
		return a.operande.equals(operande) ? null : this;
	}

	public ArrayList<Formule> reccupererAllAtomeNon() {
		ArrayList<Formule> ret = new ArrayList<Formule>();
		ret.add(new Non(((Atome) operande).reccupererAllAtomeNon().get(0)));
		return ret;
	}

	@Override
	public Formule copy() {
		return new Non(operande.copy());
	}

}
